Multiterminal net assignments by scatter search
نویسندگان
چکیده
Abs t r ac t -We address the problem of board-level multiterminal net assignment in FPGA-based logic emulation. We present a novel mathematical model for this problem. A powerful metaheuristic approach, called scatter search, is adopted. Effective heuristics are incorporated for accelerating the optimization search process. Experimental results demonstrate the promising performance of our approach. (~) 2005 Elsevier Ltd. All rights reserved.
منابع مشابه
The Integrated Supply Chain of After-sales Services Model: A Multi-objective Scatter Search Optimization Approach
Abstract: In recent decades, high profits of extended warranty have caused that third-party firms consider it as a lucrative after-sales service. However, customers division in terms of risk aversion and effect of offering extended warranty on manufacturers’ basic warranty should be investigated through adjusting such services. Since risk-averse customers welcome extended warranty, while the cu...
متن کاملBoard-level multiterminal net assignment for the partial cross-bar architecture
This paper presents a satisfiability-based method for solving the board-level multiterminal net routing problem in the digital design of clos-folded field-programmable gate array (FPGA) based logic emulation systems. The approach transforms the FPGA board-level routing task into a Boolean equation. Any assignment of input variables that satisfies the equation specifies a valid routing. We use t...
متن کاملA Novel Hybrid Approach for Email Spam Detection based on Scatter Search Algorithm and K-Nearest Neighbors
Because cyberspace and Internet predominate in the life of users, in addition to business opportunities and time reductions, threats like information theft, penetration into systems, etc. are included in the field of hardware and software. Security is the top priority to prevent a cyber-attack that users should initially be detecting the type of attacks because virtual environments are not moni...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملScatter search for the profile minimization problem
We study the problem of minimizing the profile of a network and develop a solution method by following the tenets of scatter search. Our procedure exploits the structure of the problem and includes strategies that produce and agile search with computational efficiencies. Among several mechanisms, our search includes path relinking as the basis for combining solutions to generate new ones. The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical and Computer Modelling
دوره 41 شماره
صفحات -
تاریخ انتشار 2005